Parallel adaptive mesh generation and decomposition

Parallel Dynamic Mesh Generation and Domain Decomposition

The mapping of computations to parallel machines can be realized at the various data structures associated with the computations. In the case of PDE (Partial Differential Equations) based applications, we decided to fonnulate this problem at the discrete data structures of the underlying computation [Chri 91]. In this paper, we fonnulate and implement parallel mapping algorithms on distributed ...

MDEC: MeTiS-based Domain Decomposition for Parallel 2D Mesh Generation

Domain decomposition methods are commonly employed within the context of parallel numerical algorithms. Most often, the domain decomposition is performed before the main computation begins. Within the context of mesh generation, parallel mesh generation is desired when the goal is to mesh a very large geometric domain or if very high accuracy is required. In this paper, we propose a novel techn...

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained nonsmooth optimization problems. The objective here is to solve larger problems more efficiently. The new method (PSD-MADS) is an asynchronous parallel algorithm in which the processes solve problems over subsets of var...

Parallel Tetrahedral Mesh Generation Based on A-priori Domain Decomposition

Parallel Mesh Generation

Parallel mesh generation is a relatively new research area between the boundaries of two scientific computing disciplines: computational geometry and parallel computing. In this chapter we present a survey of parallel unstructured mesh generation methods. Parallel mesh generation methods decompose the original mesh generation problem into smaller subproblems which are meshed in parallel. We org...